The final The final NETLIB - LP results
نویسندگان
چکیده
The Ne t l i b has now served for 18 years as a repository of LP problem instances available to test new codes and compare performance. But with standard linear programming solvers there is always some uncertainty about the precise values of the optimal solutions. We have implemented a program called perPlex, which using rational arithmetic computes proofs for the feasibility and optimality of a LP solution. This paper reports finally the exact optimal objective values for all Ne t l i b problems.
منابع مشابه
Implementation of Interior-point Methods for Lp Based on Krylov Subspace Iterative Solvers with Inner-iteration Preconditioning∗
We apply novel inner-iteration preconditioned Krylov subspace methods to the interior-point algorithm for linear programming (LP). Inner-iteration preconditioners recently proposed by Morikuni and Hayami enable us to overcome the severe ill-conditioning of linear equations solved in the final phase of interior-point iterations. The employed Krylov subspace methods do not suffer from rank-defici...
متن کاملA sparse proximal implementation of the LP dual active set algorithm
We present an implementation of the LPDual Active Set Algorithm (LP DASA) based on a quadratic proximal approximation, a strategy for dropping inactive equations from the constraints, and recently developed algorithms for updating a sparse Cholesky factorization after a low-rank change. Although our main focus is linear programming, the first and second-order proximal techniques that we develop...
متن کاملA New Algorithm for Determining Ultimate Pit Limits Based on Network Optimization
One of the main concerns of the mining industry is to determine ultimate pit limits. Final pit is a collection of blocks, which can be removed with maximum profit while following restrictions on the slope of the mine’s walls. The size, location and final shape of an open-pit are very important in designing the location of waste dumps, stockpiles, processing plants, access roads and other surfac...
متن کاملDecomposing Linear Programs for Parallel Solution
Coarse grain parallelism inherent in the solution of Linear Programming LP problems with block angular constraint matrices has been exploited in recent research works However these approaches su er from unscalability and load imbalance since they exploit only the exist ing block angular structure of the LP constraint matrix In this paper we consider decomposing LP constraint matrices to obtain ...
متن کاملComputation of condition numbers for linear programming problems using Peña's method
We present the computation of the condition numbers for linear programming (LP) problems from the NETLIB suite. The method of Peña [Technical report, Center for Applied Mathematics, Cornell University, May 1998] was used to compute the bounds on the distance to ill-posedness ρ(d) of a given problem instance with data d, and the condition number was computed as C(d) = ‖d‖/ρ(d). We discuss the ef...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007